0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : purification_ext
0.00/0.00	% Ordering    : rpo6
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --ho-purify ext \
0.00/0.00	  --ho-ext-axiom \
0.00/0.00	  --restrict-hidden-sup-at-vars \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n187.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 17:13:39 CST 2018
0.00/0.22	% done 38 iterations in 0.021s
0.00/0.22	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.22	% SZS output start Refutation
0.00/0.22	tff(subsetI2, axiom,
0.00/0.22	  (subsetI2 <=> (![A,B]: ((![Xx]: (in(Xx,A) => in(Xx,B))) => subset(A,B))))).
0.00/0.22	tff('0', plain,
0.00/0.22	    ![X2, X3]: (in(sk_Xx1(X2, X3), X3) | subset(X3, X2) | ~ subsetI2),
0.00/0.22	    inference('cnf', [status(esa)], [subsetI2])).
0.00/0.22	tff(setunionsingleton1, conjecture,
0.00/0.22	  (uniqinunit =>
0.00/0.22	   (subsetI2 =>
0.00/0.22	    (setunionE2 => (![A]: subset(setunion(setadjoin(A,emptyset)),A)))))).
0.00/0.22	tff(zf_stmt_0, negated_conjecture,
0.00/0.22	  (~
0.00/0.22	    (uniqinunit =>
0.00/0.22	     (subsetI2 =>
0.00/0.22	      (setunionE2 => (![A]: subset(setunion(setadjoin(A,emptyset)),A))))))).
0.00/0.22	tff('1', plain, subsetI2, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('2', plain,
0.00/0.22	    ![X2, X3]: (in(sk_Xx1(X2, X3), X3) | subset(X3, X2) | ~ $true),
0.00/0.22	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.22	tff('3', plain, ![X2, X3]: (subset(X3, X2) | in(sk_Xx1(X2, X3), X3)),
0.00/0.22	    inference('simplify', [status(thm)], ['2'])).
0.00/0.22	tff(setunionE2, axiom,
0.00/0.22	  (setunionE2 <=>
0.00/0.22	   (![A,Xx]: (in(Xx,setunion(A)) => (?[X]: (in(Xx,X) & in(X,A))))))).
0.00/0.22	tff('4', plain,
0.00/0.22	    ![X5, X6]: (~ in(X5, setunion(X6)) | in(sk_X(X5, X6), X6) | ~ setunionE2),
0.00/0.22	    inference('cnf', [status(esa)], [setunionE2])).
0.00/0.22	tff('5', plain, setunionE2, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('6', plain,
0.00/0.22	    ![X5, X6]: (~ in(X5, setunion(X6)) | in(sk_X(X5, X6), X6) | ~ $true),
0.00/0.22	    inference('demod', [status(thm)], ['4', '5'])).
0.00/0.22	tff('7', plain, ![X5, X6]: (in(sk_X(X5, X6), X6) | ~ in(X5, setunion(X6))),
0.00/0.22	    inference('simplify', [status(thm)], ['6'])).
0.00/0.22	tff(uniqinunit, axiom,
0.00/0.22	  (uniqinunit <=> (![Xx,Xy]: (in(Xx,setadjoin(Xy,emptyset)) => (Xx = Xy))))).
0.00/0.22	tff('8', plain,
0.00/0.22	    ![X0, X1]: (~ in(X0, setadjoin(X1, emptyset)) | X0 = X1 | ~ uniqinunit),
0.00/0.22	    inference('cnf', [status(esa)], [uniqinunit])).
0.00/0.22	tff('9', plain, uniqinunit, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('10', plain,
0.00/0.22	    ![X0, X1]: (~ in(X0, setadjoin(X1, emptyset)) | X0 = X1 | ~ $true),
0.00/0.22	    inference('demod', [status(thm)], ['8', '9'])).
0.00/0.22	tff('11', plain, ![X0, X1]: (X0 = X1 | ~ in(X0, setadjoin(X1, emptyset))),
0.00/0.22	    inference('simplify', [status(thm)], ['10'])).
0.00/0.22	tff('12', plain,
0.00/0.22	    ![X0, X1]:
0.00/0.22	      (~ $true
0.00/0.22	       | ~ in(X1, setunion(setadjoin(X0, emptyset)))
0.00/0.22	       | sk_X(X1, setadjoin(X0, emptyset)) = X0),
0.00/0.22	    inference('sup-', [status(thm)], ['7', '11'])).
0.00/0.22	tff('13', plain,
0.00/0.22	    ![X0, X1]:
0.00/0.22	      (sk_X(X1, setadjoin(X0, emptyset)) = X0
0.00/0.22	       | ~ in(X1, setunion(setadjoin(X0, emptyset)))),
0.00/0.22	    inference('simplify', [status(thm)], ['12'])).
0.00/0.22	tff('14', plain,
0.00/0.22	    ![X5, X6]: (~ in(X5, setunion(X6)) | in(X5, sk_X(X5, X6)) | ~ setunionE2),
0.00/0.22	    inference('cnf', [status(esa)], [setunionE2])).
0.00/0.22	tff('15', plain,
0.00/0.22	    ![X5, X6]: (~ in(X5, setunion(X6)) | in(X5, sk_X(X5, X6)) | ~ $true),
0.00/0.22	    inference('demod', [status(thm)], ['14', '5'])).
0.00/0.22	tff('16', plain, ![X5, X6]: (in(X5, sk_X(X5, X6)) | ~ in(X5, setunion(X6))),
0.00/0.22	    inference('simplify', [status(thm)], ['15'])).
0.00/0.22	tff('17', plain,
0.00/0.22	    ![X0, X1]:
0.00/0.22	      (in(X1, X0)
0.00/0.22	       | ~ in(X1, setunion(setadjoin(X0, emptyset)))
0.00/0.22	       | ~ in(X1, setunion(setadjoin(X0, emptyset)))),
0.00/0.22	    inference('sup+', [status(thm)], ['13', '16'])).
0.00/0.22	tff('18', plain,
0.00/0.22	    ![X0, X1]: (~ in(X1, setunion(setadjoin(X0, emptyset))) | in(X1, X0)),
0.00/0.22	    inference('simplify', [status(thm)], ['17'])).
0.00/0.22	tff('19', plain,
0.00/0.22	    ![X0, X1]:
0.00/0.22	      (~ $true
0.00/0.22	       | subset(setunion(setadjoin(X0, emptyset)), X1)
0.00/0.22	       | in(sk_Xx1(X1, setunion(setadjoin(X0, emptyset))), X0)),
0.00/0.22	    inference('sup-', [status(thm)], ['3', '18'])).
0.00/0.22	tff('20', plain,
0.00/0.22	    ![X0, X1]:
0.00/0.22	      (in(sk_Xx1(X1, setunion(setadjoin(X0, emptyset))), X0)
0.00/0.22	       | subset(setunion(setadjoin(X0, emptyset)), X1)),
0.00/0.22	    inference('simplify', [status(thm)], ['19'])).
0.00/0.22	tff('21', plain,
0.00/0.22	    ![X2, X3]: (~ in(sk_Xx1(X2, X3), X2) | subset(X3, X2) | ~ subsetI2),
0.00/0.22	    inference('cnf', [status(esa)], [subsetI2])).
0.00/0.22	tff('22', plain,
0.00/0.22	    ![X2, X3]: (~ in(sk_Xx1(X2, X3), X2) | subset(X3, X2) | ~ $true),
0.00/0.22	    inference('demod', [status(thm)], ['21', '1'])).
0.00/0.22	tff('23', plain, ![X2, X3]: (subset(X3, X2) | ~ in(sk_Xx1(X2, X3), X2)),
0.00/0.22	    inference('simplify', [status(thm)], ['22'])).
0.00/0.22	tff('24', plain,
0.00/0.22	    ![X0]:
0.00/0.22	      (~ $true
0.00/0.22	       | subset(setunion(setadjoin(X0, emptyset)), X0)
0.00/0.22	       | subset(setunion(setadjoin(X0, emptyset)), X0)),
0.00/0.22	    inference('sup-', [status(thm)], ['20', '23'])).
0.00/0.22	tff('25', plain, ![X0]: subset(setunion(setadjoin(X0, emptyset)), X0),
0.00/0.22	    inference('simplify', [status(thm)], ['24'])).
0.00/0.22	tff('26', plain, ~ subset(setunion(setadjoin(sk_A2, emptyset)), sk_A2),
0.00/0.22	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('27', plain, ~ $true, inference('sup-', [status(thm)], ['25', '26'])).
0.00/0.22	tff('28', plain, $false, inference('simplify', [status(thm)], ['27'])).
0.00/0.22	
0.00/0.22	% SZS output end Refutation
0.00/0.23	EOF
